Bellman–Ford algorithm - PDFSEARCH.IO - Document Search Engine

Bellman–Ford algorithm
Results: 33

#	Item
21	Positioning Unmanned Aerial Vehicles as Communication Relays for Surveillance Tasks Oleg Burdakova , Patrick Dohertyb , Kaj Holmberga , Jonas Kvarnstr¨omb , Per-Magnus Olssonb,∗ a Dept. of Mathematics. E-mail: {olbur, Add to Reading List Source URL: www.roboticsproceedings.org Language: English - Date: 2014-08-18 07:52:16 Routing algorithms Combinatorial optimization Search algorithms Network theory Shortest path problem Shortest path tree Routing A* search algorithm Bellman–Ford algorithm Mathematics Theoretical computer science Graph theory
22	J Glob Optim DOI[removed]s10898[removed]Optimal placement of UV-based communications relay nodes Oleg Burdakov · Patrick Doherty · Kaj Holmberg · Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-01-20 06:09:28 Operations research Network theory Network flow Shortest path problem Bellman–Ford algorithm Tree Graph Flow network Tree decomposition Graph theory Mathematics Theoretical computer science
23	Kinetic Spanning Trees for Minimum-Power Routing in MANETS Camillo Gentile and Robert E. Van Dyck National Institute of Standards and Technology Wireless Communications Technologies Group Gaithersburg, MD[removed]cgentile, Add to Reading List Source URL: w3.antd.nist.gov Language: English - Date: 2009-02-03 16:25:35 Routing algorithms Spanning tree Routing Minimum spanning tree Bellman–Ford algorithm Shortest path problem Wireless Routing Protocol IEEE 802.1aq Theoretical computer science Mathematics Graph theory
24	Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,il Add to Reading List Source URL: static.cs.brown.edu Language: English - Date: 2013-01-24 11:44:53 Graph coloring Vertex Graph Bellman–Ford algorithm Connected component Shortest path problem Tree Clique Matching Graph theory Graph connectivity Path
25	Monotone Percolation and The Topology Control of Wireless Networks Anxiao (Andrew) Jiang Jehoshua Bruck Add to Reading List Source URL: www.paradise.caltech.edu Language: English - Date: 2005-02-22 20:29:40 Network flow Network theory Wireless sensor network Shortest path problem Connectivity Topology control Flow network Belief propagation Bellman–Ford algorithm Graph theory Mathematics Theoretical computer science
26	THE BELLMAN-FORD ALGORITHM AND “DISTRIBUTED BELLMAN-FORD” DAVID WALDEN 1. Source of the Name Add to Reading List Source URL: www.walden-family.com Language: English - Date: 2008-08-02 17:09:27 Theoretical computer science Applied mathematics Link-state routing protocol Bellman–Ford algorithm Routing Distance-vector routing protocol Shortest path problem Dynamic programming Flooding Routing algorithms Routing protocols Mathematics
27	Distributed SociaLite: A Datalog-Based Language for Large-Scale Graph Analysis Jiwon Seo Jongsoo Park Add to Reading List Source URL: mobisocial.stanford.edu Language: English - Date: 2014-05-30 16:01:47 Graph connectivity Network theory Shortest path problem Routing algorithms Path Connected component Distance Bellman–Ford algorithm Graph Graph theory Mathematics Theoretical computer science
28	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics
29	An Experimental Study of Minimum Mean Cycle Algorithms Loukas Georgiadis1 Add to Reading List Source URL: www.siam.org Language: English - Date: 2010-03-18 09:58:54 NP-complete problems Routing algorithms Connectivity Spanning tree Graph Hamiltonian path Bellman–Ford algorithm Shortest path problem Cycle graph Graph theory Mathematics Theoretical computer science
30	March[removed]LIDS - P[removed] Add to Reading List Source URL: www.mit.edu Language: English - Date: 2001-09-30 13:24:51 Network theory Shortest path problem Bellman–Ford algorithm Linked list Search algorithms Mathematics Theoretical computer science Applied mathematics

UPDATE